Eliminating Switching Components in Binary Matrices by 0-1 Flips and Column Permutations
نویسندگان
چکیده
منابع مشابه
Fast Heuristics for Eliminating Switching Components in Binary Matrices by 0-1 Flips
Beküldte Németh Gábor 2. h, 2015-01-05 11:23 Hantos N [1], Balázs P [2]. Fast Heuristics for Eliminating Switching Components in Binary Matrices by 0-1 Flips [3]. In: Bayro-Corrochano E. [4], Hancock E. [5], editors. Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications: 19th Iberoamerican Congress (CIARP). Puerto Vallarta, Mexico: Springer; 2014. 6. p. 62-69p. (LNC...
متن کاملF-Permutations induce Some Graphs and Matrices
In this paper, by using the notion of fuzzy subsets, the concept of F-permutation is introduced. Then by applying this notion the concepts of presentation of an F-polygroup, graph of an F-permutation and F-permutation matrices are investigated.
متن کاملUndulant - Block Elimination and Integer - Preserving Matrix Inversion 1 Technical Report 418
A new formulation for LU decomposition allows efficient representation of intermediate matrices while eliminating blocks of various sizes, i.e. during “undulantblock” elimination. Its efficiency arises from its design for block encapsulization, implicit in data structures that are convenient both for process scheduling and for memory management. Row/column permutations that can destroy such enc...
متن کاملOn the Enumeration of Some D-optimal Designs
Abstract. Two matrices with elements taken from the set {−1, 1} are Hadamard equivalent if one can be converted into the other by a sequence of permutations of rows and columns, and negations of rows and columns. In this paper we summarize what is known about the number of equivalence classes of matrices having maximal determinant. We establish that there are 7 equivalence classes for matrices ...
متن کاملEla a Bruhat Order for the Class of ( 0 , 1 ) - Matrices with Row Sum Vector R and Column Sum Vector S ∗ Richard
Generalizing the Bruhat order for permutations (so for permutation matrices), a Bruhat order is defined for the class of m by n (0, 1)-matrices with a given row and column sum vector. An algorithm is given for constructing a minimal matrix (with respect to the Bruhat order) in such a class. This algorithm simplifies in the case that the row and column sums are all equal to a constant k. When k ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 141 شماره
صفحات -
تاریخ انتشار 2015